Robust Group Synchronization via Cycle-Edge Message Passing

Abstract We propose a general framework for solving the group synchronization problem, where we focus on setting of adversarial or uniform corruption and sufficiently small noise. Specifically, apply novel message passing procedure that uses cycle consistency information in order to estimate levels ratios consequently solve problem our setting. first explain why is essential effectively problems. then establish exact recovery linear convergence guarantees proposed under deterministic with corruption. These hold as long ratio corrupted cycles per edge bounded by reasonable constant. also stability sub-Gaussian further high probability common model.